Hankel transforms and variation diminishing Kernels
نویسندگان
چکیده
منابع مشابه
Best Approximation and Cyclic Variation Diminishing Kernels
where the kernel K(x, y) is strictly cyclic variation diminishing, and related problems including periodic generalized perfect splines. For various approximation problems of this type, we show the uniqueness of the best approximation and characterize the best approximation by extremal properties of the error function. The results are proved by using a characterization of best approximants from ...
متن کاملFast Hankel Transforms
JOHANSEN, H. K., and SORENSEN, K., 1979, Fast Hankel Transforms, Geophysical Prospecting 27, 876-901. Inspired by the linear filter method introduced by D. P. Ghosh in rg7o we have developed a general theory for numerical evaluation of integrals of the Hankel type: m g(r) = Sf(A)hJ,(Ar)dh; v > I. II Replacing the usual sine interpolating function by sinsh (x) = a . sin (xx)/sinh (UTW), where th...
متن کاملHankel matrix transforms and operators
Correspondence: homidan@kfupm. edu.sa Department of Mathematics and Statistics, King Fahd University of Petroleum and Minerals, Dhahran 31261, P. O. Box 119, Saudi Arabia Abstract Hankel operators and Hankel transforms are required in a number of applications. This article proves a number of theorems that efficiently and accurately approximates a function using Hankel transforms and Hankel sum....
متن کاملExtremal Vector Valued Inequalities for Hankel Transforms
The disc multiplier may be seen as a vector valued operator when we consider its projections in terms of the spherical harmonics. In this form, it represents a vector valued Hankel transform. We know that, for radial functions, it is bounded on the spaces Lplq (r n−1 dr) when 2n n+1 < p, q < 2n n−1 . Here we prove that there exist weak-type estimates for this operator for the extremal exponents...
متن کاملFast Polynomial Transforms Based on Toeplitz and Hankel Matrices
Many standard conversion matrices between coefficients in classical orthogonal polynomial expansions can be decomposed using diagonally-scaled Hadamard products involving Toeplitz and Hankel matrices. This allows us to derive O(N(logN)) algorithms, based on the fast Fourier transform, for converting coefficients of a degree N polynomial in one polynomial basis to coefficients in another. Numeri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the American Mathematical Society
سال: 1960
ISSN: 0002-9904
DOI: 10.1090/s0002-9904-1960-10383-7